Computability, noncomputability, and hyperbolic systems
نویسندگان
چکیده
منابع مشابه
Computability, noncomputability, and hyperbolic systems
In this paper we study the computability of the stable and unstable manifolds of a hyperbolic equilibrium point. These manifolds are the essential feature which characterizes a hyperbolic system. We show that (i) locally these manifolds can be computed, but (ii) globally they cannot (though we prove they are semi-computable). We also show that Smale’s horseshoe, the first example of a hyperboli...
متن کاملComputability, Noncomputability and Undecidability of Maximal Intervals of Ivps
Let (α, β) ⊆ R denote the maximal interval of existence of solutions for the initial-value problem { dx dt = f(t, x), x(t0) = x0, where E is an open subset of Rm+1, f is continuous in E and (t0, x0) ∈ E. We show that, under the natural definition of computability from the point of view of applications, there exist initial-value problems with computable f and (t0, x0) whose maximal interval of e...
متن کاملComputability and dynamical systems
In this paper we explore results that establish a link between dynamical systems and computability theory (not numerical analysis). In the last few decades, computers have increasingly been used as simulation tools for gaining insight into dynamical behavior. However, due to the presence of errors inherent in such numerical simulations, with few exceptions, computers have not been used for the ...
متن کاملNoncomputability, unpredictability, and financial markets
One of the most significant achievements from theoretical computer science was to show that there are non-computable problems, which cannot be solved through algorithms. Although the formulation of such problems is mathematical, they often can be interpreted as problems derived from other fields, like physics or computer science. However no noncomputable problem with economical or financial ins...
متن کاملSpeedup for natural problems and noncomputability
A resource-bounded version of the statement “no algorithm recognizes all non-halting Turing machines” is equivalent to an infinitely often (i.o.) superpolynomial speedup for the time required to accept any (paddable) coNPcomplete language and also equivalent to a superpolynomial speedup in proof length in propositional proof systems for tautologies, each of which implies P 6= NP. This suggests ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2012
ISSN: 0096-3003
DOI: 10.1016/j.amc.2012.09.031